The cobondage number of a graph

Reduction of Domination Parameter in Fuzzy Graphs

In this paper, the cobondage set and cobondage number bC(G) of a fuzzy graph G are defined. The upper bound of a fuzzy graph with p nodes is given as min(p − (1 + S(G)), S(G) + 1). The exact values of bC(G) for some standard fuzzy graphs are found. Some results on bC(G) are also discussed. A numerical example is also illustrated. AMS subject classification: 03E72, 05C40, 05C72.

Line completion number of grid graph Pn × Pm

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

SOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH

In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

The Maximum Number of Edges in a Strongly Multiplicative Graph